翻訳と辞書 Words near each other ・ Covering (martial arts) ・ Covering a base ・ Covering code ・ Covering force ・ Covering graph ・ Covering Ground ・ Covering group ・ Covering groups of the alternating and symmetric groups ・ Covering Islam ・ Covering Kids and Families of Indiana ・ Covering lemma ・ Covering number ・ Covering of the eyes ・ Covering of the Senne ・ Covering problem of Rado ・ Covering problems ・ Covering relation ・ Covering set ・ Covering sickness ・ Covering space ・ Covering system ・ Covering the Bases ・ Covering the Track Marks ・ Covering theorem ・ Coveris Advanced Coatings ・ CoverItLive ・ Coverity ・ Coverkill ・ Coverlet ・ Coverly, Virginia Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Covering problems ： ウィキペディア英語版 Covering problems In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually linear programs, whose dual problems are called packing problems. The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem. ==General LP formulation== In the context of linear programming, one can think of any linear program as a covering problem if the coefficients in the constraint matrix, the objective function, and right-hand side are nonnegative. More precisely, let us consider the following general integer linear program: ^n a_ x_i \geq b_j \textj=1,\dots,m |- | | $x\_i\; \backslash geq\; 0\backslash texti=1,\backslash dots,n$. |} Such an integer linear program is called covering problem if $a\_,\; b\_j,\; c\_i\; \backslash geq\; 0$ for all $i=1,\backslash dots,n$ and $j=1,\backslash dots,m$. Intuition: Assume having $n$ types of object and each object of type $i$ has an associated cost of $c\_i$. The number $x\_i$ indicates how many objects of type $i$ we buy. If the constraints $A\backslash mathbf\backslash geq\; \backslash mathbf$ are satisfied, it is said that ''$\backslash mathbf$ is a covering'' (the structures that are covered depend on the combinatorial context). Finally, an optimal solution to the above integer linear program is a covering of minimal cost. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Covering problems」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.